Imprecise Probability in Graphical Models: Achievements and Challenges

نویسنده

  • Serafín Moral
چکیده

Knowledge-based operations for graphical models in planning p. 3 Some representation and computational issues in social choice p. 15 Nonlinear deterministic relationships in Bayesian networks p. 27 Penniless propagation with mixtures of truncated exponentials p. 39 Approximate factorisation of probability trees p. 51 Abductive inference in Bayesian networks : finding a partition of the explanation space p. 63 Alert systems for production plants : a methodology based on conflict analysis p. 76 Hydrologic models for emergency decision support using Bayesian networks p. 88 Probabilistic graphical models for the diagnosis of analog electrical circuits p. 100 Qualified probabilistic predictions using graphical models p. 111 A decision-based approach for recommending in hierarchical domains p. 123 Scalable, efficient and correct learning of Markov boundaries under the faithfulness assumption p. 136 Discriminative learning of Bayesian network classifiers via the TM algorithm p. 148 Constrained score+(local)search methods for learning Bayesian networks p. 161 On the use of restrictions for learning Bayesian networks p. 174 Foundation for the new algorithm learning pseudo-independent models p. 186 Optimal threshold policies for operation of a dedicated-platform with imperfect state information-a POMDP framework p. 198 APPSSAT : approximate probabilistic planning using stochastic satisfiability p. 209 Racing for conditional independence inference p. 221 Causality, Simpson's paradox, and context-specific independence p. 233 A qualitative characterisation of causal independence models using Boolean polynomials p. 244 On the notion of dominance of fuzzy choice functions and its application in multicriteria decision making p. 257 An argumentation-based approach to multiple criteria decision p. 269 Algorithms for a nonmonotonic logic of preferences p. 281 Expressing preferences from generic rules and examples-a possibilistic approach without aggregation function p. 293 On the qualitative comparison of sets of positive and negative affects p. 305 Symmetric argumentation frameworks p. 317 Evaluating argumentation semantics with respect to skepticism adequacy p. 329 Logic of dementia guidelines in a probabilistic argumentation framework p. 341 Argument-based expansion operators in possibilistic defeasible logic programming : characterization and logical properties p. 353 Gradual valuation for bipolar argumentation frameworks p. 366 On the acceptability of arguments in bipolar argumentation frameworks p. 378 A modal logic for reasoning with contradictory beliefs which takes into account the number and the reliability of the sources p. 390 A possibilistic inconsistency handling in answer set programming p. 402 Measuring the quality of uncertain information using possibilistic logic p. 415

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning from Imprecise Data: Possibilistic Graphical Models

Graphical models—especially probabilistic networks like Bayes networks and Markov networks—are very popular to make reasoning in highdimensional domains feasible. Since constructing them manually can be tedious and time consuming, a large part of recent research has been devoted to learning them from data. However, if the dataset to learn from contains imprecise information in the form of sets ...

متن کامل

Credal nets under epistemic irrelevance

We present a new approach to credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. Instead of applying the commonly used notion of strong independence, we replace it by the weaker notion of epistemic irrelevance. We show how assessments of epistemic irrelevance allow us to construct a global model out of given local uncertainty models and mention some u...

متن کامل

Probabilistic Graphical Models

This report1 presents probabilistic graphical models that are based on imprecise probabilities using a comprehensive language. In particular, the discussion is focused on credal networks and discrete domains. It describes the building blocks of credal networks, algorithms to perform inference, and discusses on complexity results and related work. The goal is to present an easy-to-follow introdu...

متن کامل

­­Image Segmentation using Gaussian Mixture Model

Abstract: Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we used Gaussian mixture model to the pixels of an image. The parameters of the model were estimated by EM-algorithm.   In addition pixel labeling corresponded to each pixel of true image was made by Bayes rule. In fact,...

متن کامل

IMAGE SEGMENTATION USING GAUSSIAN MIXTURE MODEL

  Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we have learned Gaussian mixture model to the pixels of an image. The parameters of the model have estimated by EM-algorithm.   In addition pixel labeling corresponded to each pixel of true image is made by Bayes rule. In fact, ...

متن کامل

Local Computation in Credal Networks

The goal of this contribution is to discuss local computation in credal networks — graphical models that can represent imprecise and indeterminate probability values. We analyze the inference problem in credal networks, discuss how inference algorithms can benefit from local computation, and suggest that local computation can be particularly important in approximate inference algorithms.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005